Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
نویسندگان
چکیده
منابع مشابه
Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
This paper addresses the problem of scheduling a Markovian multiclass queue with a finite dedicated buffer for each class, where class-dependent linear holding and rejection cost rates model differing levels of tolerance to delay and loss. The goal is to design well-grounded and tractable scheduling policies that nearly minimize expected total discounted or long-run average cost. New dynamic in...
متن کاملMarginal productivity index policies for scheduling restless bandits with switching penalties
We address the dynamic scheduling problem for discrete-state restless bandits, where sequence-independent setup penalties (costs or delays) are incurred when starting work on a project. We reformulate such problems as restless bandit problems without setup penalties, and then deploy the theory of marginal productivity indices (MPIs) and partial conservation laws (PCLs) we have introduced and de...
متن کاملOn scheduling a multiclass queue with abandonments under general delay costs
We consider a multiclass queueing system with abandonments and general delay costs. A system manager makes dynamic scheduling decisions to minimize long-run average delay and abandonment costs. We consider the three types of delay cost: (i) linear, (ii) convex, and (iii) convex–concave, where the last one corresponds to settings where customers may have a particular deadline in mind but once th...
متن کاملMarginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
This paper addresses the problem of designing tractable dynamic admission control and/or routing policies in a Markovian model of parallel multi-server loss queues with reneging, which seek to optimize performance objectives of concern. Such problems are relevant in a variety of systems that provide distributed telecommunication or computing services. The paper shows the direct applicability of...
متن کاملOnline scheduling policies for multiclass call centers with impatient customers
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s +M queue, we focus on developing scheduling policies that satisfy a target ratio constraint on the abandonment probabilities of premium customers to regular ones. The problem is inspired by a real call center application in which we want to reach some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2006
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-006-0302-x